An approximative method for nonlinear programming
نویسندگان
چکیده
منابع مشابه
An augmented Lagrangian affine scaling method for nonlinear programming
In this paper, we propose an Augmented Lagrangian Affine Scaling (ALAS) algorithm for general nonlinear programming, for which a quadratic approximation to the augmented Lagrangian is minimized at each iteration. Different from the classical sequential quadratic programming (SQP), the linearization of nonlinear constraints is put into the penalty term of this quadratic approximation, which resu...
متن کاملAn interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...
متن کاملAn approximative inference method for solving ∃∀SO satisfiability problems
This paper considers the fragment ∃∀SO of second-order logic. Many interesting problems, such as conformant planning, can be naturally expressed as finite domain satisfiability problems of this logic. Such satisfiability problems are computationally hard (Σ2 ) and many of these problems are often solved approximately. In this paper, we develop a general approximative method, i.e., a sound but i...
متن کاملAn inexact-restoration method for nonlinear bilevel programming problems
We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global...
متن کاملAn objective penalty function method for nonlinear programming
K e y w o r d s N o n l i n e a r programming, Exact penalty function, Objective penalty function. 1. I N T R O D U C T I O N The problem we consider in this paper is as follows: f0(x), s.t. k ( a ) < 0, i E I = { 1 , 2 , . . . , m } , (P) The authors would like to thank anonymous referees' comments and remarks that help us to improve the presentation of this paper considerably. This research w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1958
ISSN: 0528-2195
DOI: 10.21136/cpm.1958.108637